Evolving Strategies for Updating Pheromone Trails: A Case Study with the TSP
نویسندگان
چکیده
Ant Colony Optimization is a bio-inspired technique that can be applied to solve hard optimization problems. A key issue is how to design the communication mechanism between ants that allows them to effectively solve a problem. We propose a novel approach to this issue by evolving the current pheromone trail update methods. Results obtained with the TSP show that the evolved strategies perform well and exhibit a good generalization capability when applied to larger instances.
منابع مشابه
Ant Colony Optimization for Solving Traveling Salesman Problem
An ant colony capable of solving the traveling salesman problem (TSP). TSP is NP-hard problem. Even though the problem itself is simple, when the number of city is large, the search space will become extremely large and it becomes very difficult to find the optimal solution in a short time. One of the main ideas of ant algorithms is the indirect communication of a colony of agents, called (arti...
متن کاملResearch on an Improved Ant Colony Optimization Algorithm for Solving Traveling Salesmen Problem
In order to improve the search result and low evolution speed, and avoid the tendency towards stagnation and falling into the local optimum of ant colony optimization(ACO) in solving the complex function, the traditional ant colony optimization algorithm is analyzed in detail, an improved ant colony optimization(IWSMACO) algorithm based on information weight factor and supervisory mechanism is ...
متن کاملA Pheromone Trails Model for MAX-MIN Ant System
Pheromone trails are the main media for gathering collective knowledge about a problem, and have a central role in all ant colony optimization algorithms. Setting appropriate trail limits for the MAX-MIN ant system (MMAS) is important for good performance of the algorithm. We used rigorous analysis to develop expressions that model the influence of trail limits on MMAS behavior. Besides the gen...
متن کاملThe GPU-based Parallel Ant Colony System
The Ant Colony System (ACS) is, next to Ant Colony Optimization (ACO) and the MAX-MIN Ant System (MMAS), one of the most efficient metaheuristic algorithms inspired by the behavior of ants. In this article we present three novel parallel versions of the ACS for the graphics processing units (GPUs). To the best of our knowledge, this is the first such work on the ACS which shares many key elemen...
متن کامل1 ACO Algorithms for the Traveling Salesman Problem
Ant algorithms [18, 14, 19] are a recently developed, population-based approach which has been successfully applied to several NP-hard combinatorial optimization problems [6, 13, 17, 23, 34, 40, 49]. As the name suggests, ant algorithms have been inspired by the behavior of real ant colonies, in particular, by their foraging behavior. One of the main ideas of ant algorithms is the indirect comm...
متن کامل